Using a Lattice Intension Structure to Facilitate User-Guided Association Rule Mining

نویسنده

  • Abdallah Alashqur
چکیده

Narrowing down the computational space is a key factor in improving the efficiency of an association rule mining system. One approach to achieve this is to let the user guide the association rule mining process by enabling the user to specify the types of association rules that he/she might be interested in. Instead of computing all that can be computed, the system limits its association rule mining process to the discovery of only the association rules that may be of interest to the user, therefore, reducing the computational space and complexity. In this paper, we introduce a new approach for achieving this by using a new structure called lattice intension structure.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing Membership Functions using Learning Automata for Fuzzy Association Rule Mining

The Transactions in web data often consist of quantitative data, suggesting that fuzzy set theory can be used to represent such data. The time spent by users on each web page is one type of web data, was regarded as a trapezoidal membership function (TMF) and can be used to evaluate user browsing behavior. The quality of mining fuzzy association rules depends on membership functions and since t...

متن کامل

The Minimal Description of Formal Concept Analysis

In 1982, R.Wille (1999) proposed a new model to represent the formal concepts associated to a context (G,M, I), named formal concept analysis based on the formal context, which is a pair consisting of a set of objects (the extension) and a set of attributes (the intension) such that the intension consists of exactly those attributes that the objects in the extension have in common, and the exte...

متن کامل

Mining Closed Itemsets in Data Stream Using Formal Concept Analysis

Mining of frequent closed itemsets has been shown to be more efficient thanmining frequent itemsets for generating non-redundant association rules. The task is challenging in data stream environment because of the unbounded nature and no-second-look characteristics. In this paper, we propose an algorithm, CLICI, for mining all recent closed itemsets in landmark window model of online data strea...

متن کامل

Using Data Cubes for Metarule-Guided Mining of Multi-Dimensional Association Rules

Metarule-guided mining is an interactive approach to data mining, where users probe the data under analysis by specifying hypotheses in the form of metarules, or pattern templates. Previous methods for metarule-guided mining of association rules have primarily used a transac-tion/relation table-based structure. Such approaches require costly, multiple scans of the data in order to nd all the la...

متن کامل

Association Rule Mining on Remotely Sensed Images Using Peano Count Trees

Association Rule Mining, originally proposed for market basket data, has potential applications in many areas. Remote Sensed Imagery (RSI) data is one of the promising application areas. Extracting interesting patterns and rules from datasets composed of images and associated ground data, can be of importance in precision agriculture, community planning, resource discovery and other areas. Howe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer and Information Science

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2012